A Distinguisher for High Rate McEliece Cryptosystems

International audienceThe Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece's cryptosystem. Up to now, it is widely believed that the GD problem is a hard decision problem. We present the first method allowing to distinguish alternant and Goppa codes over any field. Our technique can solve the GD problem in polynomial-time provided that the codes have sufficiently large rates. The key ingredient is an algebraic characterization of the key-recovery problem. The idea is to consider the rank of a linear system which is obtained by linearizing a particular polynomial system describing a key-recovery attack. Experimentally it appears that this dimension depends on the type of code. Explicit formulas derived from extensive experimentations for the rank are provided for "generic" random, alternant, and Goppa codes over any alphabet. Finally, we give theoretical explanations of these formulas in the case of random codes, alternant codes over any field of characteristic two and binary Goppa codes

Molecular epidemiology of DFNB1 deafness in France

BACKGROUND: Mutations in the GJB2 gene have been established as a major cause of inherited non syndromic deafness in different populations. A high number of sequence variations have been described in the GJB2 gene and the associated pathogenic effects are not always clearly established. The prevalence of a number of mutations is known to be population specific, and therefore population specific testing should be a prerequisite step when molecular diagnosis is offered. Moreover, population studies are needed to determine the contribution of GJB2 variants to deafness. We present our findings from the molecular diagnostic screening of the GJB2 and GJB6 genes over a three year period, together with a population-based study of GJB2 variants. METHODS AND RESULTS: Molecular studies were performed using denaturing High Performance Liquid Chromatograghy (DHPLC) and sequencing of the GJB2 gene. Over the last 3 years we have studied 159 families presenting sensorineural hearing loss, including 84 with non syndromic, stable, bilateral deafness. Thirty families were genotyped with causative mutations. In parallel, we have performed a molecular epidemiology study on more than 3000 dried blood spots and established the frequency of the GJB2 variants in our population. Finally, we have compared the prevalence of the variants in the hearing impaired population with the general population. CONCLUSION: Although a high heterogeneity of sequence variation was observed in patients and controls, the 35delG mutation remains the most common pathogenic mutation in our population. Genetic counseling is dependent on the knowledge of the pathogenicity of the mutations and remains difficult in a number of cases. By comparing the sequence variations observed in hearing impaired patients with those sequence variants observed in general population, from the same ethnic background, we show that the M34T, V37I and R127H variants can not be responsible for profound or severe deafness

Heat transfer in a swirling fluidized bed with Geldart type-D particles

A relatively new variant in fluidized bed technology, designated as the swirling fluidized bed (SFB), was investigated for its heat transfer characteristics when operating with Geldart type D particles. Unlike conventional fluidized beds, the SFB imparts secondary swirling motion to the bed to enhance lateral mixing. Despite its excellent hydrodynamics, its heat transfer characteristics have not been reported in the published literature. Hence, two different sizes of spherical PVC particles (2.61mm and 3.65mm) with the presence of a center body in the bed have been studied at different velocities of the fluidizing gas. The wall-to-bed heat transfer coefficients were measured by affixing a thin constant foil heater on the bed wall. Thermocouples located at different heights on the foil show a decrease in the wall heat transfer coefficient with bed height. It was seen that only a discrete particle model which accounts for the conduction between the particle and the heat transfer surface and the gas-convective augmentation can adequately represent the mechanism of heat transfer in the swirling fluidized bed

Identification of three novel OA1 gene mutations identified in three families misdiagnosed with congenital nystagmus and carrier status determination by real-time quantitative PCR assay

<p>Abstract</p> <p>Background</p> <p>X-linked ocular albinism type 1 (OA1) is caused by mutations in <it>OA1 </it>gene, which encodes a membrane glycoprotein localised to melanosomes. OA1 mainly affects pigment production in the eye, resulting in optic changes associated with albinism including hypopigmentation of the retina, nystagmus, strabismus, foveal hypoplasia, abnormal crossing of the optic fibers and reduced visual acuity. Affected Caucasian males usually appear to have normal skin and hair pigment.</p> <p>Results</p> <p>We identified three previously undescribed mutations consisting of two intragenic deletions (one encompassing exon 6, the other encompassing exons 7–8), and a point mutation (310delG) in exon 2. We report the development of a new method for diagnosis of heterozygous deletions in <it>OA1 </it>gene based on measurement of gene copy number using real-time quantitative PCR from genomic DNA.</p> <p>Conclusion</p> <p>The identification of <it>OA1 </it>mutations in families earlier reported as families with hereditary nystagmus indicate that ocular albinism type 1 is probably underdiagnosed. Our method of real-time quantitative PCR of <it>OA1 </it>exons with <it>DMD exon </it>as external standard performed on the LightCycler™ allows quick and accurate carrier-status assessment for at-risk females.</p

Un distintivo para los criptosistemas McEliece de alta velocidad

The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece's cryptosystem. Up to now, it is widely believed that the GD problem is a hard decision problem. We present the first method allowing to distinguish alternant and Goppa codes over any field. Our technique can solve the GD problem in polynomial time provided that the codes have sufficiently large rates. The key ingredient is an algebraic characterization of the key-recovery problem. The idea is to consider the rank of a linear system which is obtained by linearizing a particular polynomial system describing a key-recovery attack. It appears that this dimension depends on the type of code considered. Explicit formulas derived from extensive experimentations for the rank are provided for “generic” random, alternant, and Goppa codes over any field. Finally, we give theoretical explanations of these formulas in the case of random codes, alternant codes over any field of characteristic two and binary Goppa codes

1 A Distinguisher for High Rate McEliece

The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece’s cryptosystem. Up to now, it is widely believed that the GD problem is a hard decision problem. We present the first method allowing to distinguish alternant and Goppa codes over any field. Our technique can solve the GD problem in polynomial-time provided that the codes have sufficiently large rates. The key ingredient is an algebraic characterization of the key-recovery problem. The idea is to consider the rank of a linear system which is obtained by linearizing a particular polynomial system describing a key-recovery attack. It appears that this dimension depends on the type of code considered. Explicit formulas derived from extensive experimentations for the rank are provided for “generic ” random, alternant, and Goppa codes over any field. Finally, we give theoretical explanations of these formulas in the case of random codes, alternant codes over any field of characteristic two and binary Goppa codes

A Distinguisher for High Rate McEliece Cryptosystems

The Goppa Code Distinguishing (GCD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. Up to now, it is widely believed that the GCD problem is a hard decisional problem. We present the first technique allowing to distinguish alternant and Goppa codes over any field. Our technique can solve the GCD problem in polynomial-time provided that the codes have rates sufficiently large. The key ingredient is an algebraic characterization of the key-recovery problem. The idea is to consider the dimension of the solution space of a linearized system deduced from a particular polynomial system describing a key-recovery. It turns out that experimentally this dimension depends on the type of code. Explicit formulas derived from extensive experimentations for the value of the dimension are provided for “generic” random, alternant, and Goppa code over any alphabet. Finally, we give explanations of these formulas in the case of random codes, alternant codes over any field and binary Goppa codes